On Tilable Orthogonal Polygons∗
نویسندگان
چکیده
We consider rectangular tilings of orthogonal polygons with vertices located at integer lattice points. Let G be a set of reals closed under the usual addition operation. A G-rectangle is a rectangle at least one of whose sides is in G. We show that if an orthogonal polygon without holes can be tiled with G-rectangles then one of the sides of the polygon must be in G. As a special case this solves the conjecture that domino tilable orthogonal polygons must have at least one side of even length. We also explore separately the case of othogonal polygons placed in a chessboard. We establish a condition which determines the number of black minus white squares of the chessboard occupied by the polygon. This number depends exclusively on the parity sequence of the lengths of the sides of the orthogonal polygon. This approach produces a different proof of the conjecture of the non domino-tilability of of orthogonal polygons without even length sides. We also give some generalizations for polygons with holes and polytopes in 3 dimensions. ∗An extended abstract of this paper has appeared in the proceedings of the 11th Canadian Conference on Computational Geometry, CCCG’99, held in Vancouver, Aug. 15-18, 1999, pp. 157-161, 1999. ¶Math. Inst. of the Hungarian Acad. of Sci., P.O. Box 127, 1364 Budapest, Hungary and SUNY at Brooklyn, Brooklyn, NY 11203. email:[email protected] §Département d’Informatique, Université du Québec à Hull, Hull, Québec J8X 3X7, Canada. email: [email protected] ‖Department of Computer Science, University of Liverpool, Peach Street, L69 7ZF, Liverpool, UK. email:[email protected] ∗Carleton University, School of Computer Science, Ottawa, ON, K1S 5B6, Canada. email: [email protected] ††Departamento di Matematicas, Universiad Autonoma Metropolitana-Iztapalapa, Mexico, email: [email protected] ‡University of Ottawa, School of Information Technology and Engineering, Ottawa, ON, K1N 9B4, Canada. email: [email protected] †Research supported in part by NSERC (National Science and Engineering Research Council of Canada) grant. ∗∗Research supported in part by NUF-NAL (The Nuffield Foundation Awards to Newly Appointed Lecturers) award.
منابع مشابه
A Fast Algorithm for Covering Rectangular Orthogonal Polygons with a Minimum Number of r-Stars
Introduction This paper presents an algorithm for covering orthogonal polygons with minimal number of guards. This idea examines the minimum number of guards for orthogonal simple polygons (without holes) for all scenarios and can also find a rectangular area for each guards. We consider the problem of covering orthogonal polygons with a minimum number of r-stars. In each orthogonal polygon P,...
متن کاملTiling by rectangles and alternating current
This paper is on tilings of polygons by rectangles. A celebrated physical interpretation of such tilings due to R.L. Brooks, C.A.B. Smith, A.H. Stone and W.T. Tutte uses directcurrent circuits. The new approach of the paper is an application of alternating-current circuits. The following results are obtained: • a necessary condition for a rectangle to be tilable by rectangles of given shapes; •...
متن کاملPolygons Folding to Plural Incongruent Orthogonal Boxes
We investigate the problem of finding orthogonal polygons that fold to plural incongruent orthogonal boxes. There are two known polygons that fold to produce two incongruent orthogonal boxes. In this paper, we show that there are infinite such polygons. We also show that there exists a tile that produces two incongruent orthogonal boxes.
متن کاملAutomatic generation of 3-d building models from multiple bounded polygons
Based on building polygons (building footprints) on the digital map, we are proposing a GIS and CG integrated system to generate 3-D building models automatically. Most building polygons’ edges meet at right angles (orthogonal polygon). A complicated orthogonal polygon can be partitioned into a set of rectangles. In order to partition an orthogonal polygon, we proposed a useful polygon expressi...
متن کاملMinimum r-Star Cover of Class-3 Orthogonal Polygons
We are interested in the problem of covering simple orthogonal polygons with the minimum number of r-stars; an orthogonal polygon is an r-star if it is orthogonally convex and star-shaped. The problem has been considered by Worman and Keil who described an algorithm running in O(n 17 poly-log n) time where n is the size of the input polygon. In this paper, we consider the above problem on simpl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2002